A simple algorithm for multicuts in planar graphs with outer terminals
نویسنده
چکیده
Given an edge-weighted graph G and a list of source-sink pairs of terminal vertices of G, the minimum multicut problem consists in selecting a minimum weight set of edges of G whose removal leaves no path from the ith source to the ith sink, for each i. Few tractable special cases are known for this problem. In this paper, we give a simple polynomial-time algorithm solving it in undirected planar graphs where (I) all the terminals lie on the outer face and (II) there is a bounded number of terminals.
منابع مشابه
A Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
Given an edge-weighted undirected graph and a list of k source-sink pairs of vertices, the well-known minimum multicut problem consists in selecting a minimum-weight set of edges whose removal leaves no path between every source and its corresponding sink. We give the first polynomial-time algorithm to solve this problem in planar graphs, when k is fixed. Previously, this problem was known to r...
متن کاملMinimum multicuts and Steiner forests for Okamura-Seymour graphs
We study the problem of finding minimum multicuts for an undirected planar graph, where all the terminal vertices are on the boundary of the outer face. This is known as an Okamura-Seymour instance. We show that for such an instance, the minimum multicut problem can be reduced to the minimum-cost Steiner forest problem on a suitably defined dual graph. The minimum-cost Steiner forest problem ha...
متن کاملThe graphs with the max-Mader-flow-min-multiway-cut property
We are given a graph G, an independant set S ⊂ V (G) of terminals, and a function w : V (G) → N. We want to know if the maximum w-packing of vertex-disjoint paths with extremities in S is equal to the minimum weight of a vertex-cut separating S. We call Mader-Mengerian the graphs with this property for each independant set S and each weight function w. We give a characterization of these graphs...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملA Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals
For an undirected edge-weighted graph G and a set R of pairs of vertices called pairs of terminals, a multicut is a set of edges such that removing these edges from G disconnects each pair in R. We provide an algorithm computing a (1 + ε)-approximation of the minimum multicut of a graph G in time (g+ t)(O(g+t) 3) · (1/ε)O(g+t) ·n log n, where g is the genus of G and t is the number of terminals...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009